Forward–backward splitting algorithm for fixed point problems and zeros of the sum of monotone operators

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Primal-Dual Splitting Algorithm for Finding Zeros of Sums of Maximal Monotone Operators

We consider the primal problem of finding the zeros of the sum of a maximal monotone operator and the composition of another maximal monotone operator with a linear continuous operator. By formulating its Attouch-Théra-type dual inclusion problem, a primal-dual splitting algorithm which simultaneously solves the two problems in finitedimensional spaces is presented. The proposed scheme uses at ...

متن کامل

A primal-dual splitting algorithm for finding zeros of sums of maximally monotone operators

We consider the primal problem of finding the zeros of the sum of a maximally monotone operator with the composition of another maximally monotone operator with a linear continuous operator and a corresponding dual problem formulated by means of the inverse operators. A primal-dual splitting algorithm which simultaneously solves the two problems in finite-dimensional spaces is presented. The sc...

متن کامل

Hybrid Proximal-Point Methods for Zeros of Maximal Monotone Operators, Variational Inequalities and Mixed Equilibrium Problems

We prove strong and weak convergence theorems of modified hybrid proximal-point algorithms for finding a common element of the zero point of a maximal monotone operator, the set of solutions of equilibrium problems, and the set of solution of the variational inequality operators of an inverse stronglymonotone in a Banach space under different conditions. Moreover, applications to complementarit...

متن کامل

A Class of nonlinear $(A,eta)$-monotone operator inclusion problems with iterative algorithm and fixed point theory

A new class of nonlinear set-valued variationalinclusions involving $(A,eta)$-monotone mappings in a Banachspace setting is introduced, and then based on the generalizedresolvent operator technique associated with$(A,eta)$-monotonicity, the existence and approximationsolvability of solutions using an iterative algorithm and fixedpint theory is investigated.

متن کامل

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

This paper shows, by means of a new type of operator called a splitting operator, that the Douglas-Rachford splitting method for finding a zero of the sum of two monotone operators is a special case of the proximal point algorithm. Therefore, applications of Douglas-Rachford splitting, such as the alternating direction method of multipliers for convex programming decomposition, are also special...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Arabian Journal of Mathematics

سال: 2019

ISSN: 2193-5343,2193-5351

DOI: 10.1007/s40065-018-0236-2